翻訳と辞書 |
Turán number : ウィキペディア英語版 | Turán number In mathematics, the Turán number T(''n'',''k'',''r'') for ''r''-uniform hypergraphs of order ''n'' is the smallest number of ''r''-edges such that every induced subgraph on ''k'' vertices contains an edge. This number was determined for ''r'' = 2 by , and the problem for general ''r'' was introduced in . The paper gives a survey of Turán numbers. ==Definitions== Fix a set ''X'' of ''n'' vertices. For given ''r'', an ''r''-edge or block is a set of ''r'' vertices. A set of blocks is called a Turán (''n'',''k'',''r'') system (''n'' ≥ ''k'' ≥ ''r'') if every ''k''-element subset of ''X'' contains a block. The Turán number T(''n'',''k'',''r'') is the minimum size of such a system.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Turán number」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|